- least fixpoint
- Программирование: наименьшая неподвижная точка
Универсальный англо-русский словарь. Академик.ру. 2011.
least fixpoint
Смотреть что такое "least fixpoint" в других словарях:
Least fixed point — In order theory, a branch of mathematics, the least fixed point (lfp or LFP) of a function is the fixed point which is less than or equal to all other fixed points, according to some partial order. For example, the least fixed point of the real… … Wikipedia
Kleene fixpoint theorem — In the mathematical areas of order and lattice theory, the Kleene fixed point theorem, named after American mathematician Stephen Cole Kleene, states the following:: Let L be a complete partial order, and let f : L → L be a continuous (and… … Wikipedia
Knaster–Tarski theorem — In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:: Let L be a complete lattice and let f : L → L be an order preserving function. Then the set … Wikipedia
Complete partial order — In mathematics, directed complete partial orders and ω complete partial orders (abbreviated to dcpo, ωcpo or sometimes just cpo) are special classes of partially ordered sets, characterized by particular completeness properties. Complete partial… … Wikipedia
Modal μ-calculus — In theoretical computer science, the modal μ calculus (also μ calculus, but this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint… … Wikipedia
Stratification (mathematics) — Stratification has several usages in mathematics. In mathematical logic In mathematical logic, stratification is any consistent assignment of numbers to predicate symbols guaranteeing that a unique formal interpretationof a logical theory exists … Wikipedia
Corecursion — In computer science, corecursion is a type of operation that is dual to recursion. Corecursion and codata allow total languages to work with infinite data structures such as streams. Corecursion is often used in conjunction with lazy evaluation.… … Wikipedia
Mu calculus — The μ calculus (also modal μ calculus) is a class of temporal logics with a least fixpoint operator μ. It is used to describe properties of labelled transition systems and for verifying these properties.The (propositional) μ calculus was invented … Wikipedia
Data-flow analysis — is a technique for gathering information about the possible set of values calculated at various points in a computer program. A program s control flow graph (CFG) is used to determine those parts of a program to which a particular value assigned… … Wikipedia
Fixed point (mathematics) — Not to be confused with a stationary point where f (x) = 0. A function with three fixed points In mathematics, a fixed point (sometimes shortened to fixpoint, also known as an invariant point) of a function is a point[1] that is … Wikipedia
Fixed point theorem — In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F ( x ) = x ), under some conditions on F that can be stated in general terms. Results of this kind are amongst the … Wikipedia
